- target distribution algorithm
- алгоритм целераспределения
English-Russian military dictionary. 2014.
target distribution algorithm
Смотреть что такое "target distribution algorithm" в других словарях:
Metropolis–Hastings algorithm — The Proposal distribution Q proposes the next point that the random walk might move to. In mathematics and physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a… … Wikipedia
Gerchberg–Saxton algorithm — The Gerchberg Saxton (GS) algorithm is an iterative algorithm for retrieving the phase of a pair of light distributions (or any other mathematically valid distribution) related via a propagating function, such as the Fourier transform, if their… … Wikipedia
CHAOS (Linux distribution) — infobox OS name = CHAOS caption = CHAOS 1.6 Boot Welcome Screen developer = Midnight Code / Ian Latter family = Linux source model = Open source latest release version = 1.6 latest release date = April 2005] working state = Currentcite web |… … Wikipedia
Von Mises distribution — Probability distribution name =von Mises type =density pdf The support is chosen to be [ π,π] with μ=0 cdf The support is chosen to be [ π,π] with μ=0 parameters =mu real kappa>0 support =xin any interval of length 2π pdf =frac{e^{kappacos(x… … Wikipedia
Linux distribution — A Linux distribution is a member of the family of Unix like operating systems built on top of the Linux kernel. Such distributions (often called distros for short) are operating systems including a large collection of software applications such… … Wikipedia
k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… … Wikipedia
K-nearest neighbor algorithm — In pattern recognition, the k nearest neighbor algorithm ( k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance based learning, or lazy learning where the function is only… … Wikipedia
Multiple-try Metropolis — In Markov chain Monte Carlo, the Metropolis–Hastings algorithm (MH) can be used to sample from a probability distribution which is difficult to sample from directly. However, the MH algorithm requires the user to supply a proposal distribution,… … Wikipedia
Bayesian inference in phylogeny — generates a posterior distribution for a parameter, composed of a phylogenetic tree and a model of evolution, based on the prior for that parameter and the likelihood of the data, generated by a multiple alignment. The Bayesian approach has… … Wikipedia
Rejection sampling — In mathematics, rejection sampling is a technique used to generate observations from a distribution. It is also commonly called the acceptance rejection method or accept reject algorithm .It generates sampling values from an arbitrary probability … Wikipedia
Markov chain Monte Carlo — MCMC redirects here. For the organization, see Malaysian Communications and Multimedia Commission. Markov chain Monte Carlo (MCMC) methods (which include random walk Monte Carlo methods) are a class of algorithms for sampling from probability… … Wikipedia
